package org.fioma.tree;

public interface Label<L> {

	// return -1 if the word equal to label else return position of the first mismatch
	public int getMinsmatch(Label word);

	public String toString();

	public int getLength();

	public L substring(int pos, int length);

	// from pos to end
	public L substring(int pos);

//	// create a new word
//	public L join(Label word);

	public char getChar(int pos);

	public byte getByte(int pos);
}
